Sensitivity analysis for dynamic systems with time-lags
نویسندگان
چکیده
منابع مشابه
Sensitivity Analysis for Nonsmooth Dynamic Systems
Nonsmoothness in dynamic process models can hinder conventional methods for simulation, sensitivity analysis, and optimization, and can be introduced, for example, by transitions in flow regime or thermodynamic phase, or through discrete changes in the operating mode of a process. While dedicated numerical methods exist for nonsmooth problems, these methods require generalized derivative inform...
متن کاملEvolutionary learning of dynamic probabilistic models with large time lags
In this paper, we explore the automatic explanation of Multivariate Time Series (MTS) through learning Dynamic Bayesian Networks (DBNs). We have developed an evolutionary algorithm which exploits certain characteristics of process MTS in order to generate good networks as quickly as possible. We compare this algorithm to other standard learning algorithms that have traditionally been used for s...
متن کاملoptimal boundary control for infinite variables parabolic systems with time lags given in integral form
in this paper, the optimal boundary control problem for distributed parabolic systems, involving second orderoperator with an infinite number of variables, in which constant lags appear in the integral form both in the state equations and in the boundary condition is considered. some specific properties of the optimal control arediscussed.
متن کاملA Modified Multi Time Step Integration for Dynamic Analysis
In this paper new implicit higher order accuracy (N-IHOA) time integration based on assumption of constant time step is presented for dynamic analysis. This method belongs to the category of the multi time step integrations. Here, current displacement and velocity are assumed to be functions of the velocities and accelerations of several previous time steps, respectively. This definition causes...
متن کاملPolynomial-time approximation schemes for scheduling problems with time lags
We identify two classes of machine scheduling problems with time lags that possess Polynomial-Time Approximation Schemes (PTASs). These classes together, one for minimizing makespan and one for minimizing total completion time, include many well-studied time lag scheduling problems. The running times of these approximation schemes are polynomial in the number of jobs, but exponential in the num...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational and Applied Mathematics
سال: 2003
ISSN: 0377-0427
DOI: 10.1016/s0377-0427(02)00659-3